System Evolving using Ant Colony Optimization Algorithm

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolving Ant Colony Optimization

Ant Colony Optimization (ACO) is a promising new approach to combinatorial optimization. Here ACO is applied to the traveling salesman problem (TSP). Using a genetic algorithm (GA) to nd the best set of parameters, we demonstrate the good performance of ACO in nding good solutions

متن کامل

Ant Colony Optimization Algorithm

Hybrid algorithm is proposed to solve combinatorial optimization problem by using Ant Colony and Genetic programming algorithms. Evolutionary process of Ant Colony Optimization algorithm adapts genetic operations to enhance ant movement towards solution state. The algorithm converges to the optimal final solution, by accumulating the most effective sub-solutions.

متن کامل

Information Hiding Using Ant Colony Optimization Algorithm

This paper aims to find an effective and efficient information hiding method used for protecting secret information by embedding it in a cover media such as images. Finding the optimal set of the image pixel bits to be substituted by the secret message bits, such that the cover image is of high quality, is a complex process and there is an exponential number of feasible solutions. Two new ant-b...

متن کامل

A New Ant Colony Optimization Algorithm: Three Bound Ant System

Since its introduction, ant colony optimization (ACO) algorithms and especially the MAX-MIN ant system (MMAS) [4] are found to be well suited for many challenging optimization problems. Our theoretical analyses of MMAS allowed us to create the new algorithm, named the three bound ant system (TBAS), which has lower computational complexity and at the same time retains and even improves the quali...

متن کامل

Ant Colony System Optimization

Successful heuristic algorithms for solving combinatorial optimization problems have mimicked processes observed in nature. Two highly successful families of algorithms that do this are simulated annealing and genetic algorithms. Here, a third family of algorithms, ant colony optimization is explored and implemented in C#. The test bed for evaluating the quality of solutions is based on several...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer Science

سال: 2009

ISSN: 1549-3636

DOI: 10.3844/jcssp.2009.380.387